Transferring data directly between a processor and a spatial light modulator

ABSTRACT

A method of loading data into a spatial light modulator, in which a software programmable processor stores binary values for the pixels of at least a portion of the (x,y) array of a spatial light modulator. The processor stores these values in its addressable memory, and accesses them by calculating bit positions in memory words (elements), as a function of x and y and other parameters of the processor and spatial light modulator. The same concepts may be applied to reading data out of a spatial light modulator.

TECHNICAL FIELD

This invention relates generally to the field of spatial light modulators and more specifically to loading data into (or reading data from) a spatial light modulator.

BACKGROUND OF THE DISCLOSURE

One type of spatial light modulator (SLM) is a Digital Micromirror Device (DMD), an microelectromechanical system (MEMS) device that operates as a reflective digital light switch. A DMD may be used in a variety of applications. As an example, a DMD may be used in an imaging system such as a digital light processing (DLP™) system for projecting images. In an imaging system, pre-recorded data is typically loaded into the DMD. As another example, a DMD may be used in an optical networking system to process, for example, wavelength division multiplexed (WDM) light signals. In an optical switching system, a pattern to be loaded into the DMD is typically locally generated and may be frequently updated.

Different applications present different requirements on how data is processed and loaded into the DMD. Known techniques for loading data into a DMD include using either an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA) device to load data into the DMD. These known techniques, however, may be inefficient in some circumstances.

SUMMARY OF THE DISCLOSURE

According to one embodiment of the present invention, loading data into a spatial light modulator includes storing in the addressable memory of one or more processors, binary values for at least a portion of a pixel array of a spatial light modulator. The processor accesses the binary values, using an algorithm that maps each binary value to the kth position in the jth word of the processor's addressable memory. The processor calculates the j and k values as functions of the following: the (x,y) coordinate values of the pixel array, the processor's internal word size, and the ratio of the number of elements in the pixel array to the width of the data bus between the spatial light modulator and the processor. The processor then directly loads the binary values to the spatial light modulator.

A technical advantage of the above-described embodiment is that data may be loaded directly from a processor into the SLM. The processor is programmed to load data by associating a bit of a word in the addressable memory to a pixel of an array of the spatial light modulator. Accordingly, the processor may comprise a commercial off-the-shelf programmable processor rather than a hardware implementation such ASIC or FPGA devices that may require customization.

Certain embodiments of the invention may include none, some, or all of the above technical advantages. One or more other technical advantages may be readily apparent to one skilled in the art from the figures, descriptions, and claims included herein.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention and its features and advantages, reference is now made to the following description, taken in conjunction with the accompanying drawings, in which:

FIG. 1 is a block diagram illustrating one embodiment of a system that includes a processor that loads data directly into a DMD;

FIG. 2 is a block diagram illustrating one embodiment of a system that includes multiple processors that load data directly into a DMD;

FIG. 3 illustrates a portion of one embodiment of a mirror array of a DMD;

FIG. 4 illustrates example memory cells corresponding to the portion of the mirror array of FIG. 3;

FIG. 5 is a diagram illustrating one embodiment of a process of sending data to a DMD; and

FIG. 6 is a flowchart illustrating one embodiment of a method for loading data into a DMD.

DETAILED DESCRIPTION OF THE DRAWINGS

Embodiments of the present invention and its advantages are best understood by referring to FIGS. 1 through 5 of the drawings, like numerals being used for like and corresponding parts of the various drawings.

FIG. 1 is a block diagram illustrating one embodiment of a system 10 that includes a processor that loads data directly into a spatial light modulator. The processor may be programmed to load data by associating each kth bit of a jth word in an addressable memory to a pixel value, z(x,y), of an array of the spatial light modulator. Accordingly, the processor may comprise a commercial off-the-shelf programmable processor rather than hardware implementations such ASIC or FPGA devices that may require customization.

For purposes of example herein, the processor loads data directly into a digital micromirror device (DMD) type SLM. The processor may also be used to load data into other types of SLMs, such as a liquid-crystal display (LCD) or plasma-based display.

Although the following description is mostly in terms of loading data to an SLM, the same concepts may be applied to reading data out of an SLM. The data is transferred from the SLM to the processor's addressable memory, using the same associations of z(x,y) to a kth bit of a jth word, as described herein.

According to the illustrated embodiment, system 10 includes a processor 20, an N-bit bus interface 22, a digital micromirror device 24, and support circuitry 28 coupled as shown. According to one embodiment of operation, processor 20 generates a data array that instructs DMD 24 to produce a specific pattern. DMD 24 produces the pattern by tilting micromirrors to reflect light according to the pattern.

Processor 20 is programmed to load data by associating a bit of a word in an addressable memory to a pixel of an array of the spatial light modulator. Accordingly, the processor may comprise a commercial off-the-shelf programmable processor rather than a hardware implementation such ASIC or FPGA devices that may require customization. As used in this document, “processor” may comprise any suitable processor having a CPU, programmable software, and internal or external addressable memory. As an example, processor 20 may comprise an embedded processor such as a processor of the TMS 320C64x family of processors manufactured by TEXAS INSTRUMENTS, INC.

Processor 20 may include control logic 30, an addressable memory 32, and data lines 34. Control logic 30 controls the operation of processor 20. Addressable memory 32 stores the data array. Data lines 34 transmit the data array from addressable memory 32 to interface 22. In read operations, data lines 34 receive the data array from interface 22 and stores the data in the addressable memory 32.

According to one embodiment, processor 20 may synchronize data output to DMD 24. Processor 20 may operate as either a master that initiates the transfer of data or a slave that starts the transfer of data after receiving an external request. For illustration purposes only, processor 20 is shown as operating as a slave. When DMD 24 is ready to receive data, support circuitry 28 sends a synchronization signal to processor 20. In response, processor 20 starts the transfer of data. There may be a small but fixed amount of delay from the time processor 20 receives the synchronization signal to the time the data is transferred to interface 22. As an example, processor 20 may have direct memory access capabilities to synchronize and transfer data.

Processor 20 may operate to provide continuous data transfer at a rate governed by DMD 24, and may control the amount of data transferred to provide either a complete or partial image. Interface 22 transfers data from processor 20 to DMD 24, and may comprise a N-bit bus interface that is directly coupled to the inputs of DMD 24.

DMD 24 reflects light according to a pattern. DMD 24 includes a mirror array that constitutes pixels, where each pixel comprises a structure that is operable to reflect light at a certain angle in response to digital instructions. As an example, a mirror array may comprise hundreds or thousands of rows and columns of pixels.

A pixel may have any suitable configuration. According to one embodiment, a pixel may comprise a monolithically integrated MEMS superstructure cell fabricated over a memory cell such as a static random access memory (SRAM) cell.

Support circuitry 28 provides control signals to processor 20 and DMD 24. As an example, support circuitry 28 provides a clock signal and a synchronization signal to processor 20. The synchronization signal may be used to interrupt processor 20 and initiate and synchronize data transfer.

Alterations or permutations such as modifications, additions, or omissions may be made to system 10 without departing from the scope of the invention. System 10 may have more, fewer, or other modules. Moreover, the operations of system 10 may be performed by more, fewer, or other modules. For example, the operations of processor 20 and support circuitry 28 may be performed by one module, or the operations of processor 20 may be performed by more than one processor 20. Additionally, operations of system 20 may be performed using any suitable logic comprising software, hardware, other logic, or any suitable combination of the preceding. As used in this document, “each” refers to each member of a set or each member of a subset of a set.

FIG. 2 is a block diagram illustrating one embodiment of a system 60 that includes multiple processors 20 that load data directly into DMD 24. Although system 60 is illustrated with three processors 20 a-c, system 60 may include any suitable number of processors 20. Support circuitry 28 may coordinate processors 20 to load data directly into DMD 24.

FIG. 3 illustrates a portion 40 of one embodiment of a mirror array of DMD 24 that includes pixels 42. Variable x represents location along an x-axis corresponding to a row of portion 40. Variable y represents location along a y-axis corresponding to a column of portion 40. Accordingly, a pixel 42 may be described as having a location (x,y). Parameter X represents the number of columns of portion 40, and parameter Y represents the number of rows of portion 40. The mirrors of pixels 42 may be tilted at different angles according to a pattern. According to the illustrated embodiment, mirrors at pixels {x: 8≦x≦15, y=10} are tilted in one direction and the mirrors of the other pixels are tilted in another direction.

Alterations or permutations such as modifications, additions, or omissions may be made to portion 40 without departing from the scope of the invention. Portion 40 may have more or fewer pixels 42 arranged in any suitable configuration.

FIG. 4 illustrates example memory cells 46 of portion 40 of the mirror array of FIG. 3. Memory cells 46 may be used to store the pattern for the mirror array. A pattern may include patterns values, where each pattern value is used to control the tilt of the mirror of a corresponding pixel 42. As an example, a pattern value of one may cause a mirror to tilt in one direction, while a pattern value of zero may cause the mirror to tilt in another direction. Each memory cell 46 may store a pattern value.

A pattern value z for a pixel 42 at location (x, y) may be expressed using a function z=f(x,y). According to the illustrated example, the pattern stored at memory cells 46 may be expressed as z=1 for (x: 8≦x≦15, y=10), and z=0 otherwise. These pattern values may yield the pattern of FIG. 2.

Alterations or permutations such as modifications, additions, or omissions may be made to memory cells 46 without departing from the scope of the invention. Memory cells 46 may have more or fewer memory cells.

FIG. 5 is a diagram 50 illustrating one embodiment of a process for sending data to DMD 24. According to the illustrated embodiment, N represents the number of data lines of DMD 24, and B_(i) represents a bus for a data line i of DMD 24. The data includes pattern values Z_(k), k=0, 1, . . . , X−1, for a row, where parameter X represents the number of pixels in a row. The X pattern values are divided into N groups, where each group includes M=X/N pattern values. A group of M pattern values is serially input into one of the N data lines. If the data lines simultaneously shift data into DMD 24, a row of data may be filled after M clock cycles.

FIG. 6 is a flowchart illustrating one embodiment of a method for loading data into DMD 24. The method begins at step 100, where the system parameters are established. According to one embodiment, DMD 24 has N data lines and a mirror array with X pixels per row and Y pixels per column. One or more processors 20 have L data lines, where L may be greater than or equal to N. One or more processors 20 also have an internal data width W. A pattern value of a pattern for a pixel at (x,y) may be given by function Z_(x,y)=f(x,y). The number X is divisible by N, and the number of pattern values for each loading group is M=X/N.

Steps 108, 113, 118, and 122 illustrate creation of a data array that may be loaded into DMD 24. The data array includes entries that instruct pixels 42 to form a specific pattern. Each entry may be used to record a pattern value for a pixel 42 corresponding to the entry. As an example, the data array comprises a single memory array WbitSingleDataArray[size], or A[size], that includes the bit information for DMD 24. Each entry of the array has a width of W, so the size of the array is (X*Y)/W. Bit position k of each entry of the array may be described using: W-1 W-2 1 0

k bitW-1 bitW-2 bit1 bit0

bits in each entry

According to one embodiment, a word array may be used. As an example, a word array may comprise a single array bitMask[W] of width W with W entries. The bitMask[W] may be defined to include words, where each word has one bit set in one unique position starting from the least significant bit to the most significant bit.

If the number of data lines N of DMD 24 is greater than data memory width W of processor 20 but less than or equal to 2*W at step 104, the method proceeds to step 108. A word array is generated at step 108. As an example, a word array comprising bitMask[W=32] may be defined according to Equation (1): $\begin{matrix} \begin{matrix} {{{bitMask}\lbrack 32\rbrack} = \left\{ {{0 \times 00000001},{0 \times 00000002},{0 \times 00000004},{0 \times 00000008}\quad,} \right.} \\ {{0 \times 00000010},{0 \times 00000020},{0 \times 00000040},{0 \times 00000080}\quad,} \\ {{0 \times 00000100},{0 \times 00000200},{0 \times 00000400},{0 \times 00000800}\quad,} \\ {{0 \times 00001000},{0 \times 00002000},{0 \times 00004000},{0 \times 00008000}\quad,} \\ {{0 \times 00010000},{0 \times 00020000},{0 \times 00040000},{0 \times 00080000}\quad,} \\ {{0 \times 00100000},{0 \times 00200000},{0 \times 00400000},{0 \times 00800000}\quad,} \\ {{0 \times 01000000},{0 \times 02000000},{0 \times 04000000},{0 \times 08000000}\quad,} \\ \left. {{0 \times 10000000},{0 \times 20000000},{0 \times 40000000},{0 \times 80000000}}\quad \right\} \end{matrix} & (1) \end{matrix}$

As another example, bitMask[W=16] may be defined according to Equation (2): $\begin{matrix} \begin{matrix} {{{bitMask}\lbrack 16\rbrack} = \left\{ {{0 \times 0001},{0 \times 0002},{0 \times 0004},{0 \times 0008},} \right.} \\ {{0 \times 0010},{0 \times 0020},{0 \times 0040},{0 \times 0080},} \\ {{0 \times 0100},{0 \times 0200},{0 \times 0400},{0 \times 0800},} \\ \left. {{0 \times 1000},{0 \times 2000},{0 \times 4000},{0 \times 8000}} \right\} \end{matrix} & (2) \end{matrix}$

A data array is generated at step 112. As an example, a data array comprising A[X*Y/W] may be generated. For a given pixel at location (x,y), the pattern value Z_(x,y)=f(x,y) of the pixel corresponds to a bit k of element j of A[X*Y/W]. An “element” of the addressable memory may also be referred to as a “word”. The values of k and j may be determined by Equations (3) and (4): j=2*M*y+2*(M−1−|x| _(M))+[x/(W*M)]  (3) k=|[x/M]|_(W)  (4) where “*” represents a multiply operation, for example, 32*2=64; “/” represents a division operation, for example, 32/16=2; “|.|_(M)” represents a modulo M operation, for example, |2|₆=2, |18|₁₆=2; and “[.]” represents a truncation operation, for example, [1/16]=[0.0625]=0 and [17/16]=[1.0625]=1.

A data array for a specific pattern may be generated by updating each entry to record the pattern values. For example, if Z_(x,y)=0, bit k in element j may be updated according to Equation (5): A[j]=A[j] &(˜bitMask[k])  (5) and if Z_(x,y)=1, bit k in element j may be updated according to Equation (6): A[j]=A[j]|bitMask[k]  (6) where “˜” represents a bitwise negation operation, for example, if 4-bit data B=1010, then ˜B=0101; “&” represents a bitwise AND operation, for example, if 4-bit data B₁=1011 and B₂=1101, then B₁&B₂=1001; and “|” represents a bitwise OR operation, for example, if 4-bit data B₁=1011 and B₂=1101, then B₁|B₂=1111.

In a first example, the number of pixels of one row X=1024, number of pixels of one column Y=768, number of processor data lines L=number of DMD data lines N=64, and processor internal data width W=32. The number of pattern values per group M=X/N=1024/64=16. The pattern may be described by Equation (7): $\begin{matrix} {z_{x,y} = \left\{ \begin{matrix} {1,{{{for}\quad x} = {2n}},{y = 0},{n = 01},\ldots\quad,511} \\ {1,{{{for}\quad x} = {{2n} + 1}},{y = 1},{n = 0},1,\ldots\quad,511} \\ {1,{{for}\quad{all}\quad{other}\quad x\quad{and}\quad y}} \end{matrix} \right.} & (7) \end{matrix}$ The corresponding element j and bit k of the A[X*Y/W] for each (x,y) may be given by Equations (8): $\begin{matrix} \begin{matrix} {{A\lbrack 1\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 0\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 3\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 2\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 5\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 4\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 7\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 6\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 9\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 8\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 11\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 10\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 13\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 12\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 15\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 14\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 17\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 16\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 19\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 18\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 21\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 20\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 23\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 22\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 25\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 24\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 27\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 26\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 29\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 28\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 31\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 30\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 33\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 32\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 35\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 34\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 37\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 36\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 39\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 38\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 41\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 40\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 43\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 42\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 45\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 44\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 47\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 46\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 49\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 48\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 51\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 50\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 53\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 52\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 55\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 54\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 57\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 56\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 59\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 58\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 61\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 60\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 63\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 62\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 65\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 64\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 67\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 66\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \end{matrix} & (8) \end{matrix}$

In a second example, the number of pixels of one row X=800, number of pixels of one column Y=600, number of processor data lines L=64, number of DMD data lines N=50, and processor internal data width W=32. The number of pattern values per group M=X/N=800/50=16. The pattern may be described by Equation (7).

The corresponding element j and bit k of the A[X*Y/W] for each (x,y) may be given by Equations (9): $\begin{matrix} \begin{matrix} {{A\lbrack 1\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 0\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 3\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 2\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 5\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 4\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 7\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 6\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 9\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 8\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 11\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 10\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 13\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 12\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 15\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 14\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 17\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 16\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 19\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 18\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 21\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 20\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 23\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 22\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 25\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 24\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 27\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 26\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 29\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 28\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 31\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 30\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 33\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 32\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 35\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 34\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 37\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 36\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 39\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 38\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 41\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 40\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 43\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 42\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 45\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 44\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 47\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 46\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 49\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 48\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 51\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 50\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 53\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 52\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 55\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 54\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 57\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 56\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 59\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 58\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 61\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 11\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 60\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 63\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 62\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 65\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 64\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 67\rbrack} = \left\lbrack {x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad x\quad 00\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 66\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {\vdots\quad} & \quad \end{matrix} & (9) \end{matrix}$

In a third example, the number of pixels of one row X=640, number of pixels of one column Y=512, number of processor data lines L=number of DMD data lines N=64, and processor internal data width W=32. The number of pattern values per group M=X/N=640/64=10. The pattern may be described by Equation (7).

The corresponding element j and bit k of the A[X*Y/W] for each (x,y) may be given by Equations (10): $\begin{matrix} \begin{matrix} {{A\lbrack 1\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 0\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 3\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 2\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 5\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 4\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 7\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 6\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 9\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 8\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 11\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 10\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 13\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 12\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 15\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 14\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 17\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 16\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 19\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 18\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 21\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 20\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 23\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 22\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 25\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 24\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 27\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 26\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 29\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 28\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 31\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 30\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 33\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 32\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 35\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 34\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 37\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} & {{A\lbrack 36\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 39\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 38\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 41\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 40\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 43\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 42\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 45\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} & {{A\lbrack 44\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {\vdots\quad} & \quad \end{matrix} & (10) \end{matrix}$

Data is loaded into DMD 24 at step 114. The data may be loaded from a data array a bus B_(i) in the following manner: data bus: B_(L-I)B_(L-2) B₁B₀ data at clock n: A[1] A[0] data at clock n + 1: A[3] A[2], and so on. After loading the data into DMD 24, the method terminates.

If the number of data lines N of DMD 24 is less than data memory width W of processor 20 at step 104, the method proceeds to step 118. A word array is generated at step 118. The word array may be generated in a manner similar to that described with reference to step 108.

A data array is generated at step 122. As an example, a data array comprising A[X*Y/W] may be generated. For a given pixel at location (x,y), the pattern value Z_(x,y)=f(x,y) of the pixel corresponds to a bit k of element j of A[X*Y/W], where k and j may be determined by Equations (11) and (12): j=M*y+(M−1−|x| _(M))  (11) k=|[x/M]|_(W)  (12) A data array for a specific pattern may be generated by updating each entry to record the pattern values of the pattern. For example, entries may be updated according to Equations (5) and (6).

Data is loaded into DMD 24 at step 124. The data may be loaded from a data array a bus Bi in the following manner: data bus: B_(L-1) B_(L-2) . . . B₁B₀ data at clock n: A[0] data at clock n + 1: A[1] data at clock n + 2: A[2] data at clock n + 3: A[3], and so on.

In an example, the number of pixels of one row X=640, number of pixels of one column Y=512, number of processor data lines L=number of DMD data lines N=32, and processor internal data width W=32. The group number of pattern values per group M=X/N=640/32 =20. The pattern may be described by Equation (7).

The corresponding element j and bit k of the A[X*Y/W] for each (x,y) may be given by Equations (13): $\begin{matrix} \begin{matrix} {{A\lbrack 0\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 1\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 2\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 3\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 4\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 5\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 6\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 7\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 8\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 9\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 10\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 11\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 12\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 13\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 14\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 15\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 16\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 17\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 18\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 19\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 20\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 21\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 22\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 23\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 24\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 25\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 26\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 27\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 28\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 29\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 30\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 31\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 32\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 33\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 34\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 35\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 36\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 37\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 38\rbrack} = \left\lbrack {11111111\quad 11111111\quad 11111111\quad 11111111} \right\rbrack} \\ {{A\lbrack 39\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 40\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 41\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {{A\lbrack 42\rbrack} = \left\lbrack {00000000\quad 00000000\quad 00000000\quad 00000000} \right\rbrack} \\ {\vdots\quad} \end{matrix} & (13) \end{matrix}$ After loading the data into DMD 24, the method terminates.

Alterations or permutations such as modifications, additions, or omissions may be made to the method without departing from the scope of the invention. The method may include more, fewer, or other steps. Additionally, steps may be performed in any suitable order without departing from the scope of the invention.

Certain embodiments of the invention may provide one or more technical advantages. A technical advantage of one embodiment may be that data may be loaded directly from a processor into a DMD. Loading data directly from a processor may be more efficient. Another technical advantage of one embodiment may be that the processor may be programmed to load data by associating a bit of a word in the addressable memory to a pixel of an array of the spatial light modulator. Accordingly, the processor may comprise a commercial off-the-shelf programmable processor rather than a hardware implementation such ASIC or FPGA devices that may require customization.

While this disclosure has been described in terms of certain embodiments and generally associated methods, alterations and permutations of the embodiments and methods will be apparent to those skilled in the art. Accordingly, the above description of example embodiments does not define or constrain this disclosure. Other changes, substitutions, and alterations are also possible without departing from the spirit and scope of this disclosure, as defined by the following claims.

To aid the Patent Office and any readers of any patent issued on this application in interpreting the claims appended hereto, applicants wish to note that they do not intend any of the appended claims to invoke paragraph 6 of 35 U.S.C. § 112 as it exists on the date of filing hereof unless the words “means for” or “step for” are used in the particular claim. 

1. A method of loading data into a spatial light modulator having an (x,y) array of pixels, comprising: storing binary pixel values in addressable memory of one or more processors; accessing binary pixel values for (x,y) positions of the pixel array by calculating a position in a word of the addressable memory as a function of (x,y), and retrieving the binary value at that position; directly loading groups of the binary values to the spatial light modulator via a number of data lines.
 2. The method of claim 1, wherein the spatial light modulator is a digital micromirror device.
 3. The method of claim 1, wherein each position in a word is calculated by calculating the kth position in the jth word, where j is a function of x and y and k is a function of x.
 4. The method of claim 3, wherein j is further a function of the processor's internal data width.
 5. The method of claim 3, wherein j is further a function of the number of pixels in one row of the array divided by the number of data lines.
 6. The method of claim 3, wherein k is further a function of the number of pixels in one row of the array divided by the number of data lines.
 7. A system for loading data to a spatial light modulator, comprising: a spatial light modulator having an array of pixels, the array having a size of x bits per row and y rows; and one or more processors coupled to the spatial light modulator via data lines, each processor having a programmable processing unit and addressable memory; wherein the one or more processors are programmed to locate a position in a word of the addressable memory as a function of the (x,y) coordinate values, to repeat the locating steps for a group of binary values, and to deliver the group of binary values to the spatial light modulator; and a number of data lines for transmitting groups of binary values from the processor to the spatial light modulator.
 8. The system of claim 7, wherein the spatial light modulator is a digital micromirror device.
 9. The system of claim 7, wherein each position in a word is calculated by calculating the kth position in the jth word, where j is a function of x and y and k is a function of x.
 10. The system of claim 9, wherein j is further a function of the processor's internal data width.
 11. The system of claim 9, wherein j is further a function of the number of pixels in one row of the array divided by the number of data lines.
 12. The system of claim 3, wherein k is further a function of the number of pixels in one row of the array divided by the number of data lines.
 13. A method of using a processor's addressable memory to directly load binary data stored in the addressable memory to a spatial light modulator's (x,y) array, via a number of data lines, comprising the steps of: expressing each (x,y) binary value as corresponding to a bit k in an element j of the memory; wherein j is a function of x, y, M, and W; wherein k is a function of x; wherein W is the processor's internal data width of each element; and wherein M is the number of elements in one row of the array divided by the number of data lines.
 14. The method of claim 13, wherein the width of the data bus is greater than the width of each element but less than or equal to twice the data width of each element.
 15. The method of claim 13, wherein: W<N≦2W; L≧N, L represents the processor's external bus width; X is divisible by N, X representing a total number of rows of the spatial light modulator; j=2*M*y+2*(M−1−|x| _(M))+[x/ (W*M)]; and k=|[x/M]| _(W).
 16. The method of claim 13, wherein: W<N≦2W; L≧N, L representing the processor's external bus width; X is divisible by N, X representing a total number of rows of the spatial light modulator; j=2*M*y+2*(M −1−|x| _(M))+[x/ (W*M)]; and k=|[x/M]| _(W), and further comprising: updating k of j to record a pattern value z_(x,y) using a data array A[X*Y/W] and a memory buffer bitMask[k] according to: A[j]=A[j] &(˜bitMask[k]) if z_(x,y)=0; and A[j]=A[j]|bitMask[k] if z_(x,y)=1
 17. The method of claim 13, further comprising: updating k of j to record a pattern value z_(x,y) using a data array A[X*Y/W] and a memory buffer bitMask[k] according to: A[j]=A[j] &(˜bitMask[k]) if z_(x,y)=0; and A[j]=A[j]|bitMask[k] if z_(x,y)=1
 18. The method of claim 13, wherein the width of the data bus is less than or equal to the data width of each element.
 19. The method of claim 13, wherein: N≦W; L≧N, L representing the processor's external bus width; X is divisible by N, X representing a total number of rows of the spatial light modulator; j=M*y+(M−1−|x| _(M)); and k=|[x/M]|_(W).
 20. The method of claim 13, wherein: N≦2W; L≧N, L representing the processor's external bus width; X is divisible by N, X representing a total number of rows of the spatial light modulator; j=M*y+(M−1−|x| _(M)); and k=|[x/M]|_(W), and further comprising: updating k of j to record a pattern value z_(x,y) using a data array A[X*Y/W] and a memory buffer bitMask[k] according to: A[j]=A[j] &(˜bitMask[k]) if z_(x,y)=0; and A[j]=A[j]|bitMask[k] if z_(x,y)=1.
 21. A processor for loading data to a spatial light modulator, comprising: an addressable memory that stores binary values, each binary value corresponding to a pixel of the spatial light modulator; and processing logic coupled to the addressable memory and operable to directly load binary data for a spatial light modulator's (x,y) array, via a data bus, by: expressing each (x,y) binary value as corresponding to a bit k in an element j of the memory; wherein j is a function of x, y, M, and W, and k is a function of x; wherein W is the processor's internal data width of each element; and wherein M is the number of pixels in one row of the array divided by N, N representing the width of the data bus; retrieving each binary value from its kth position in a jth memory element; and delivering groups of binary values to the spatial light modulator.
 22. A method of reading data from spatial light modulator having an (x,y) array of pixels directly to a processor, comprising: receiving binary pixel values from the spatial light modulator via a number of data lines; and storing each binary pixel values for an (x,y) position of the pixel array by calculating a position in a word of the addressable memory as a function of (x,y), and storing the binary value at that position.
 23. A method of mapping binary pixel values of a spatial light modulator pixel array to addressable memory of a processor, comprising the steps of: expressing pixel values of the array as z(x,y) values; and calculating words of the addressable memory and bit positions within the words, as functions of x and y.
 24. The method of claim 23, wherein each z(x,y) value is calculated as the kth position in the jth word, wherein j is a function of x, y, M, and W, and k is a function of x; wherein W is the processor's internal data width of each word; and wherein M is the number of pixels in one row of the array divided by N, N representing the width of a data bus between the processor and the spatial light modulator. 